Factorization and Regularization by Dimensional Reduction
نویسندگان
چکیده
Since an old observation by Beenakker et al, the evaluation of QCD processes in dimensional reduction has repeatedly led to terms that seem to violate the QCD factorization theorem. We reconsider the example of the process gg → tt̄ and show that the factorization problem can be completely resolved. A natural interpretation of the seemingly non-factorizing terms is found, and they are rewritten in a systematic and factorized form. The key to the solution is that the Dand (4 − D)-dimensional parts of the 4-dimensional gluon have to be regarded as independent partons.
منابع مشابه
Using Dimensional Reduction for Hadronic Collisions
We discuss how to apply regularization by dimensional reduction for computing hadronic cross sections at next-to-leading order. We analyze the infrared singularity structure, demonstrate that there are no problems with factorization, and show how to use dimensional reduction in conjunction with standard parton distribution functions. We clarify that different versions of dimensional reduction w...
متن کاملLabel-Informed Non-negative Matrix Factorization with Manifold Regularization for Discriminative Subnetwork Detection
In this paper, we present a novel method for obtaining a low dimensional representation of a complex brain network that: (1) can be interpreted in a neurobiologically meaningful way, (2) emphasizes group differences by accounting for label information, and (3) captures the variation in disease subtypes/severity by respecting the intrinsic manifold structure underlying the data. Our method is a ...
متن کاملA new approach for building recommender system using non negative matrix factorization method
Nonnegative Matrix Factorization is a new approach to reduce data dimensions. In this method, by applying the nonnegativity of the matrix data, the matrix is decomposed into components that are more interrelated and divide the data into sections where the data in these sections have a specific relationship. In this paper, we use the nonnegative matrix factorization to decompose the user ratin...
متن کاملImplicit Regularization in Matrix Factorization
We study implicit regularization when optimizing an underdetermined quadratic objective over a matrix X with gradient descent on a factorization of X . We conjecture and provide empirical and theoretical evidence that with small enough step sizes and initialization close enough to the origin, gradient descent on a full dimensional factorization converges to the minimum nuclear norm solution.
متن کاملRegularized non-negative matrix factorization with temporal dependencies for speech denoising
We present a technique for denoising speech using temporally regularized nonnegative matrix factorization (NMF). In previous work [1], we used a regularized NMF update to impose structure within each audio frame. In this paper, we add frame-to-frame regularization across time and show that this additional regularization can also improve our speech denoising results. We evaluate our algorithm on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005